|
|
Implementation of restoring method for reading bar code
Kadlčík, Libor ; Bartušek, Karel (referee) ; Mikulka, Jan (advisor)
Bar code stores information in the form of series of bars and gaps with various widths, and therefore can be considered as an example of bilevel (square) signal. Magnetic bar codes are created by applying slightly ferromagnetic material to a substrate. Sensing is done by reading oscillator, whose frequency is modulated by presence of the mentioned ferromagnetic material. Signal from the oscillator is then subjected to frequency demodulation. Due to temperature drift of the reading oscillator, the demodulated signal is accompanied by DC drift. Method for removal of the drift is introduced. Also, drift-insensitive detection of presence of a bar code is described. Reading bar codes is complicated by convolutional distortion, which is result of spatially dispersed sensitivity of the sensor. Effect of the convolutional distortion is analogous to low-pass filtering, causing edges to be smoothed and overlapped, and making their detection difficult. Characteristics of convolutional distortion can be summarized into point-spread function (PSF). In case of magnetic bar codes, the shape of the PSF can be known in advance, but not its width of DC transfer. Methods for estimation of these parameters are discussed. The signal needs to be reconstructed (into original bilevel form) before decoding can take place. Variational methods provide effective way. Their core idea is to reformulate reconstruction as an optimization problem of functional minimization. The functional can be extended by other functionals (regularizations) in order to considerably improve results of reconstruction. Principle of variational methods will be shown, including examples of use of various regularizations. All algorithm and methods (including frequency demodulation of signal from reading oscillator) are digital. They are implemented as a program for a microcontroller from the PIC32 family, which offers high computing power, so that even blind deconvolution (when the real PSF also needs to be found) can be finished in a few seconds. The microcontroller is part of magnetic bar code reader, whose hardware allows the read information to be transferred to personal computer via the PS/2 interface or USB (by emulating key presses on virtual keyboard), or shown on display.
|
|
|
Blind Image Deconvolution of Electron Microscopy Images
Schlorová, Hana ; Odstrčilík, Jan (referee) ; Walek, Petr (advisor)
V posledních letech se metody slepé dekonvoluce rozšířily do celé řady technických a vědních oborů zejména, když nejsou již limitovány výpočetně. Techniky zpracování signálu založené na slepé dekonvoluci slibují možnosti zlepšení kvality výsledků dosažených zobrazením pomocí elektronového mikroskopu. Hlavním úkolem této práce je formulování problému slepé dekonvoluce obrazů z elektronového mikroskopu a hledání vhodného řešení s jeho následnou implementací a porovnáním s dostupnou funkcí Matlab Image Processing Toolboxu. Úplným cílem je tedy vytvoření algoritmu korigujícícho vady vzniklé v procesu zobrazení v programovém prostředí Matlabu. Navržený přístup je založen na regularizačních technikách slepé dekonvoluce.
|
|
|
On kernel-based nonlinear regression estimation
Kalina, Jan ; Vidnerová, P.
This paper is devoted to two important kernel-based tools of nonlinear regression: the Nadaraya-Watson estimator, which can be characterized as a successful statistical method in various econometric applications, and regularization networks, which represent machine learning tools very rarely used in econometric modeling. This paper recalls both approaches and describes their common features as well as differences. For the Nadaraya-Watsonestimator, we explain its connection to the conditional expectation of the response variable. Our main contribution is numerical analysis of suitable data with an economic motivation and a comparison of the two nonlinear regression tools. Our computations reveal some tools for the Nadaraya-Watson in R software to be unreliable, others not prepared for a routine usage. On the other hand, the regression modeling by means of regularization networks is much simpler and also turns out to be more reliable in our examples. These also bring unique evidence revealing the need for a careful choice of the parameters of regularization networks
|
|
|
On kernel-based nonlinear regression estimation
Kalina, Jan ; Vidnerová, Petra
This paper is devoted to two important kernel-based tools of nonlinear regression: the Nadaraya-Watson estimator, which can be characterized as a successful statistical method in various econometric applications, and regularization networks, which represent machine learning tools very rarely used in econometric modeling. This paper recalls both approaches and describes their common features as well as differences. For the Nadaraya-Watson estimator, we explain its connection to the conditional expectation of the response variable. Our main contribution is numerical analysis of suitable data with an economic motivation and a comparison of the two nonlinear regression tools. Our computations reveal some tools for the Nadaraya-Watson in R software to be unreliable, others not prepared for a routine usage. On the other hand, the regression modeling by means of regularization networks is much simpler and also turns out to be more reliable in our examples. These also bring unique evidence revealing the need for a careful choice of the parameters of regularization networks
|
|
| |
|
|
Regularization methods for discrete inverse problems in single particle analysis
Havelková, Eva ; Hnětynková, Iveta (advisor) ; Plešinger, Martin (referee)
The aim of this thesis is to investigate applicability of regulariza- tion by Krylov subspace methods to discrete inverse problems arising in single particle analysis (SPA). We start with a smooth model formulation and describe its discretization, yielding an ill-posed inverse problem Ax ≈ b, where A is a lin- ear operator and b represents the measured noisy data. We provide theoretical background and overview of selected methods for the solution of general linear inverse problems. Then we focus on specific properties of inverse problems from SPA, and provide experimental analysis based on synthetically generated SPA datasets (experiments are performed in the Matlab enviroment). Turning to the solution of our inverse problem, we investigate in particular an approach based on iterative Hybrid LSQR with inner Tikhonov regularization. A reliable stopping criterion for the iterative part as well as parameter-choice method for the inner regularization are discussed. Providing a complete implementation of the proposed solver (in Matlab and in C++), its performance is evaluated on various SPA model datasets, considering high levels of noise and realistic distri- bution of orientations of scanning angles. Comparison to other regularization methods, including the ART method traditionally used in SPA,...
|
|
|
Lineární algebraické modelování úloh s nepřesnými daty
Vasilík, Kamil ; Hnětynková, Iveta (advisor) ; Janovský, Vladimír (referee)
In this thesis we consider problems Ax b arising from the discretization of ill-posed problems, where the right-hand side b is polluted by (unknown) noise. It was shown in [29] that under some natural assumptions, using the Golub-Kahan iterative bidiagonalization the noise level in the data can be estimated at a negligible cost. Such information can be further used in solving ill-posed problems. Here we suggest criteria for detecting the noise revealing iteration in the Golub-Kahan iterative bidiagonalization. We discuss the presence of noise of different colors. We study how the loss of orthogonality affects the noise revealing property of the bidiagonalization.
|
|
|
Regularization methods for discrete inverse problems in single particle analysis
Havelková, Eva ; Hnětynková, Iveta (advisor)
The aim of this thesis is to investigate applicability of regulariza- tion by Krylov subspace methods to discrete inverse problems arising in single particle analysis (SPA). We start with a smooth model formulation and describe its discretization, yielding an ill-posed inverse problem Ax ≈ b, where A is a lin- ear operator and b represents the measured noisy data. We provide theoretical background and overview of selected methods for the solution of general linear inverse problems. Then we focus on specific properties of inverse problems from SPA, and provide experimental analysis based on synthetically generated SPA datasets (experiments are performed in the Matlab enviroment). Turning to the solution of our inverse problem, we investigate in particular an approach based on iterative Hybrid LSQR with inner Tikhonov regularization. A reliable stopping criterion for the iterative part as well as parameter-choice method for the inner regularization are discussed. Providing a complete implementation of the proposed solver (in Matlab and in C++), its performance is evaluated on various SPA model datasets, considering high levels of noise and realistic distri- bution of orientations of scanning angles. Comparison to other regularization methods, including the ART method traditionally used in SPA,...
|
|
|
Methods for enforcing non-negativity of solution in Krylov regularization
Hoang, Phuong Thao ; Hnětynková, Iveta (advisor) ; Pozza, Stefano (referee)
The purpose of this thesis is to study how to overcome difficulties one typically encounters when solving non-negative inverse problems by standard Krylov subspace methods. We first give a theoretical background to the non-negative inverse problems. Then we concentrate on selected modifications of Krylov subspace methods known to improve the solution significantly. We describe their properties, provide their implementation and propose an improvement for one of them. After that, numerical experiments are presented giving a comparison of the methods and analyzing the influence of the present parameters on the behavior of the solvers. It is clearly demonstrated, that the methods imposing nonnegativity perform better than the unconstrained methods. Moreover, our improvement leads in some cases to a certain reduction of the number of iterations and consequently to savings of the computational time while preserving a good quality of the approximation.
|
|
|
Techniques For Avoiding Model Overfitting On Small Dataset
Kratochvila, Lukas
Building a deep learning model based on small dataset is difficult, even impossible. Toavoiding overfitting, we must constrain model, which we train. Techniques as data augmentation,regularization or data normalization could be crucial. We have created a benchmark with a simpleCNN image classifier in order to find the best techniques. As a result, we compare different types ofdata augmentation and weights regularization and data normalization on a small dataset.
|
guest ::
